Bounds for the capacity error function for unidirectional channels with noiseless feedback

نویسندگان

چکیده

In digital systems such as fiber optical communications, the ratio between probability of errors type 1 ? 0 and can be large. Practically, one assume that only error occur. These are called asymmetric. Unidirectional differ from asymmetric errors; here both possible, but in any submitted codeword all same type. This generalized for q -ary case. We consider unidirectional channels with feedback where have magnitude give bounds capacity function. It turns out depend on parity alphabet size . Furthermore, we show feedback, function binary channel is different symmetric channel. contrast to behavior without feedback.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bounds for Multiple-Access Relay Channels with Feedback via Two-way Relay Channel

In this study, we introduce a new two-way relay channel and obtain an inner bound and an outer bound for the discrete and memoryless multiple access relay channels with receiver-source feedback via two-way relay channel in which end nodes exchange signals by a relay node. And we extend these results to the Gaussian case. By numerical computing, we show that our inner bound is the same with o...

متن کامل

The AVC with noiseless feedback and maximal error probability: A capacity formula with a trichotomy

To use common randomness in coding is a key idea from the theory of identification. Methods and ideas of this theory are shown here to have also an impact on Shannon’s theory of transmission. As indicated in the title, we determine the capacity for a classical channel with a novel structure of the capacity formula. This channel models a robust search problem in the presence of noise (see R. Ahl...

متن کامل

Capacity of General Discrete Noiseless Channels

This paper concerns the capacity of the discrete noiseless channel introduced by Shannon. A sufficient condition is given for the capacity to be well-defined. For a general discrete noiseless channel allowing non-integer valued symbol weights, it is shown that the capacity—if well-defined—can be determined from the radius of convergence of its generating function, from the smallest positive pol...

متن کامل

PSPACE hardness of approximating the capacity of Markoff channels with noiseless feedback

It will be proved that approximating the capacity of a Markoff channel with noiseless feedback is PSPACE-hard. By ‘approximating,’ we mean, computing the capacity within a certain given additive error e. A class of channels will be constructed for which it will be proved that approximating the capacity to within 0.1 bits of the correct capacity is PSPACE-hard. To the best of the knowledge of th...

متن کامل

Optimal partial feedback design for MIMO block fading channels with causal noiseless feedback

In this paper, we focus in investigating the optimal MIMO transmission strategy and the optimal feedback strategy for forward channel capacity and forward error exponent of the MIMO block fading channels when the feedback link is causal and has a capacity constraint. In this paper, we assume a forward MIMO block fading channel where the channel state information is estimated at the receiver and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2021

ISSN: ['1879-2294', '0304-3975']

DOI: https://doi.org/10.1016/j.tcs.2020.11.049